Overcoming lossy channel bounds using a single quantum repeater node
نویسندگان
چکیده
منابع مشابه
A High Bandwidth Quantum Repeater
W. J. Munro, 2, ∗ R. Van Meter, 3 Sebastien G.R. Louis, 4 and Kae Nemoto Hewlett-Packard Laboratories, Filton Road, Stoke Gifford, Bristol BS34 8QZ, United Kingdom National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan Keio University, 5322 Endo, Fujisawa, Kanagawa, 252-8520, Japan Department of Informatics, School of Multidisciplinary Sciences, The Graduate Un...
متن کاملQuantum repeater with encoding
Liang Jiang, J. M. Taylor, Kae Nemoto, W. J. Munro, Rodney Van Meter, and M. D. Lukin Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan Hewlett-Packard Laboratories, Filton Road, St...
متن کاملRecursive Quantum Repeater Networks
Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving fl...
متن کاملOptimization of Quantum Repeater Protocols
We consider a dynamic programming approach for the systematic optimization of standard quantum repeater protocols. For the specific optimization problem we choose to fix the distance and fidelity of a desired entangled pair (a fundamental resource for long-distance quantum communication) and attempt to minimize the time required to create such a pair. Taking advantage of the natural self-simila...
متن کاملDelay Bounds of a Dynamic Priority Queueing Scheme : Single Node
The issue of providing deterministic delay guarantee using the Dynamic Priority Queueing (DPQ) scheme to support multiple connections at a single server queue is investigated. The novelty of our approach lies in that the delay bound is derived without making any assumptions about the traac characteristics of the connections. We rst show that the DPQ server provides a delay bound comparable to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Physics B
سال: 2016
ISSN: 0946-2171,1432-0649
DOI: 10.1007/s00340-016-6373-4